Application of the Ant Colony Optimization Metaheuristic to Multi-objective Optimization Problems
نویسنده
چکیده
This report is devoted to Multiobjective Combinatorial Optimization techniques. In particular, the Ant Colony Optimization metaheuristic and its possible multi-criteria extensions are analysed and impirically investigated on the wellknown Traveling Salesman Problem. The second part of this work presents a quite novel approach for doing Relational Multicriteria Clustering. Besides providing the decision maker with a partition of the considered possible actions, the proposed algorithm not only uses the relational multicriteria information provided as input data during the cluster construction phase, but also returns the preferential relations that bind the built clusters.
منابع مشابه
An Ant Colony approach to forward-reverse logistics network design under demand certainty
Forward-reverse logistics network has remained a subject of intensive research over the past few years. It is of significant importance to be issued in a supply chain because it affects responsiveness of supply chains. In real world, problems are needed to be formulated. These problems usually involve objectives such as cost, quality, and customers' responsiveness and so on. To this reason, we ...
متن کاملA new multi-objective mathematical model for a Citrus supply chain network design: Metaheuristic algorithms
Nowadays, the citrus supply chain has been motivated by both industrial practitioners and researchers due to several real-world applications. This study considers a four-echelon citrus supply chain, consisting of gardeners, distribution centers, citrus storage, and fruit market. A Mixed Integer Non-Linear Programming (MINLP) model is formulated, which seeks to minimize the total cost and maximi...
متن کاملExtending ACOR to Solve Multi-Objective Problems
Ant Colony Optimization (ACO) was first proposed to solve the Traveling Salesman Problem, and later applied to solve more problems of a combinatorial nature. Some research based on ACO to tackle continuous problems has been published, but this has not followed the original ACO metaheuristic exactly. Recently, ACOR has been proposed to solve continuous function optimization problems. We have tak...
متن کاملOptimisation multi-objectif par colonies de fourmis : cas des problèmes de sac à dos. (Multi-objective ant colony optimization : case of knapsack problems)
In this thesis, we investigate the capabilities of Ant Colony Optimization (ACO) metaheuristic tosolve combinatorial and multi-objective optimization problems. First, we propose a taxonomy ofACO algorithms proposed in the literature to solve multi-objective problems. Then, we studydifferent pheromonal strategies for the case of mono-objective multidimensional knapsackproblem. We...
متن کاملA Non-dominated Sorting Ant Colony Optimization Algorithm Approach to the Bi-objective Multi-vehicle Allocation of Customers to Distribution Centers
Distribution centers (DCs) play important role in maintaining the uninterrupted flow of goods and materials between the manufacturers and their customers.This paper proposes a mathematical model as the bi-objective capacitated multi-vehicle allocation of customers to distribution centers. An evolutionary algorithm named non-dominated sorting ant colony optimization (NSACO) is used as the optimi...
متن کامل